0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.34	% Computer   : n009.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 1200
0.14/0.34	% WCLimit    : 120
0.14/0.34	% DateTime   : Tue Jul 13 12:06:13 EDT 2021
0.14/0.34	% CPUTime    : 
0.14/0.34	% Number of cores: 8
0.14/0.35	% Python version: Python 3.6.8
0.14/0.35	# Version: 2.6rc1-ho
0.14/0.35	# No SInE strategy applied
0.14/0.35	# Trying AutoSched0 for 59 seconds
0.21/0.38	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S003A
0.21/0.38	# and selection function PSelectNegativeLiterals.
0.21/0.38	#
0.21/0.38	# Preprocessing time       : 0.027 s
0.21/0.38	# Presaturation interreduction done
0.21/0.38	
0.21/0.38	# Proof found!
0.21/0.38	# SZS status Theorem
0.21/0.38	# SZS output start CNFRefutation
0.21/0.38	thf(cTHM559_pme, conjecture, (![X1:a]:?[X2:a > $o]:((?[X3:a]:X2 @ X3&X2 @ X1)&![X4:a]:(![X5:a]:(X2 @ X5<=>cQ @ X4 @ X5)<=X2 @ X4))=>((![X1:a]:cQ @ X1 @ X1&![X1:a, X5:a]:(cQ @ X1 @ X5=>cQ @ X5 @ X1))&![X1:a, X5:a, X3:a]:((cQ @ X5 @ X3&cQ @ X1 @ X5)=>cQ @ X1 @ X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM559_pme)).
0.21/0.38	thf(c_0_1, negated_conjecture, ~((![X1:a]:?[X2:a > $o]:((?[X3:a]:X2 @ X3&X2 @ X1)&![X4:a]:(X2 @ X4=>![X5:a]:(X2 @ X5<=>cQ @ X4 @ X5)))=>((![X1:a]:cQ @ X1 @ X1&![X1:a, X5:a]:(cQ @ X1 @ X5=>cQ @ X5 @ X1))&![X1:a, X5:a, X3:a]:((cQ @ X5 @ X3&cQ @ X1 @ X5)=>cQ @ X1 @ X3)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM559_pme])])).
0.21/0.38	thf(c_0_2, negated_conjecture, ![X17:a, X20:a, X21:a, X22:a]:(((epred1_1 @ X17 @ (esk1_1 @ X17)&epred1_1 @ X17 @ X17)&((~epred1_1 @ X17 @ X21|cQ @ X20 @ X21|~epred1_1 @ X17 @ X20)&(~cQ @ X20 @ X22|epred1_1 @ X17 @ X22|~epred1_1 @ X17 @ X20)))&((((cQ @ esk6_0 @ esk7_0|(cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0))&(cQ @ esk5_0 @ esk6_0|(cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0)))&(~cQ @ esk5_0 @ esk7_0|(cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0)))&(((cQ @ esk6_0 @ esk7_0|(~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0))&(cQ @ esk5_0 @ esk6_0|(~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0)))&(~cQ @ esk5_0 @ esk7_0|(~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.21/0.38	thf(c_0_3, negated_conjecture, ![X1:a, X3:a, X4:a]:(cQ @ X4 @ X3|~epred1_1 @ X1 @ X3|~epred1_1 @ X1 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_4, negated_conjecture, ![X1:a]:epred1_1 @ X1 @ X1, inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_5, negated_conjecture, ![X3:a, X1:a]:(cQ @ X1 @ X3|~epred1_1 @ X3 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.21/0.38	thf(c_0_6, negated_conjecture, ![X4:a, X3:a, X1:a]:(epred1_1 @ X4 @ X3|~cQ @ X1 @ X3|~epred1_1 @ X4 @ X1), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_7, negated_conjecture, (cQ @ esk5_0 @ esk6_0|cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_8, negated_conjecture, ![X1:a]:cQ @ X1 @ X1, inference(spm,[status(thm)],[c_0_5, c_0_4])).
0.21/0.38	thf(c_0_9, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_10, negated_conjecture, ![X1:a, X3:a]:(epred1_1 @ X1 @ X3|~cQ @ X1 @ X3), inference(spm,[status(thm)],[c_0_6, c_0_4])).
0.21/0.38	thf(c_0_11, negated_conjecture, (cQ @ esk5_0 @ esk6_0|cQ @ esk3_0 @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
0.21/0.38	thf(c_0_12, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk3_0 @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_8])])).
0.21/0.38	thf(c_0_13, negated_conjecture, (cQ @ esk3_0 @ esk4_0|epred1_1 @ esk5_0 @ esk6_0), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.21/0.38	thf(c_0_14, negated_conjecture, (cQ @ esk3_0 @ esk4_0|epred1_1 @ esk6_0 @ esk7_0), inference(spm,[status(thm)],[c_0_10, c_0_12])).
0.21/0.38	thf(c_0_15, negated_conjecture, (cQ @ esk3_0 @ esk4_0|cQ @ esk6_0 @ esk5_0), inference(spm,[status(thm)],[c_0_5, c_0_13])).
0.21/0.38	thf(c_0_16, negated_conjecture, (cQ @ esk3_0 @ esk4_0|~cQ @ esk5_0 @ esk7_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_17, negated_conjecture, ![X1:a]:(cQ @ esk3_0 @ esk4_0|cQ @ X1 @ esk7_0|~epred1_1 @ esk6_0 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_14])).
0.21/0.38	thf(c_0_18, negated_conjecture, (cQ @ esk3_0 @ esk4_0|epred1_1 @ esk6_0 @ esk5_0), inference(spm,[status(thm)],[c_0_10, c_0_15])).
0.21/0.38	thf(c_0_19, negated_conjecture, (cQ @ esk3_0 @ esk4_0|~cQ @ esk5_0 @ esk7_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_8])])).
0.21/0.38	thf(c_0_20, negated_conjecture, cQ @ esk3_0 @ esk4_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
0.21/0.38	thf(c_0_21, negated_conjecture, (cQ @ esk5_0 @ esk6_0|~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_22, negated_conjecture, epred1_1 @ esk3_0 @ esk4_0, inference(spm,[status(thm)],[c_0_10, c_0_20])).
0.21/0.38	thf(c_0_23, negated_conjecture, (cQ @ esk5_0 @ esk6_0|~cQ @ esk4_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_8])])).
0.21/0.38	thf(c_0_24, negated_conjecture, cQ @ esk4_0 @ esk3_0, inference(spm,[status(thm)],[c_0_5, c_0_22])).
0.21/0.38	thf(c_0_25, negated_conjecture, cQ @ esk5_0 @ esk6_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
0.21/0.38	thf(c_0_26, negated_conjecture, (cQ @ esk6_0 @ esk7_0|~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_27, negated_conjecture, epred1_1 @ esk5_0 @ esk6_0, inference(spm,[status(thm)],[c_0_10, c_0_25])).
0.21/0.38	thf(c_0_28, negated_conjecture, (cQ @ esk6_0 @ esk7_0|~cQ @ esk4_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_8])])).
0.21/0.38	thf(c_0_29, negated_conjecture, (~cQ @ esk5_0 @ esk7_0|~cQ @ esk4_0 @ esk3_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.38	thf(c_0_30, negated_conjecture, ![X1:a]:(epred1_1 @ esk5_0 @ X1|~cQ @ esk6_0 @ X1), inference(spm,[status(thm)],[c_0_6, c_0_27])).
0.21/0.38	thf(c_0_31, negated_conjecture, cQ @ esk6_0 @ esk7_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_24])])).
0.21/0.38	thf(c_0_32, negated_conjecture, (~cQ @ esk4_0 @ esk3_0|~cQ @ esk5_0 @ esk7_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_8])])).
0.21/0.38	thf(c_0_33, negated_conjecture, ![X1:a, X3:a]:(cQ @ X1 @ X3|~epred1_1 @ X1 @ X3), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.21/0.38	thf(c_0_34, negated_conjecture, epred1_1 @ esk5_0 @ esk7_0, inference(spm,[status(thm)],[c_0_30, c_0_31])).
0.21/0.38	thf(c_0_35, negated_conjecture, ~cQ @ esk5_0 @ esk7_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_24])])).
0.21/0.38	thf(c_0_36, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), ['proof']).
0.21/0.38	# SZS output end CNFRefutation
0.21/0.38	# Proof object total steps             : 37
0.21/0.38	# Proof object clause steps            : 34
0.21/0.38	# Proof object formula steps           : 3
0.21/0.38	# Proof object conjectures             : 37
0.21/0.38	# Proof object clause conjectures      : 34
0.21/0.38	# Proof object formula conjectures     : 3
0.21/0.38	# Proof object initial clauses used    : 9
0.21/0.38	# Proof object initial formulas used   : 1
0.21/0.38	# Proof object generating inferences   : 16
0.21/0.38	# Proof object simplifying inferences  : 20
0.21/0.38	# Training examples: 0 positive, 0 negative
0.21/0.38	# Parsed axioms                        : 3
0.21/0.38	# Removed by relevancy pruning/SinE    : 0
0.21/0.38	# Initial clauses                      : 12
0.21/0.38	# Removed in clause preprocessing      : 2
0.21/0.38	# Initial clauses in saturation        : 10
0.21/0.38	# Processed clauses                    : 120
0.21/0.38	# ...of these trivial                  : 5
0.21/0.38	# ...subsumed                          : 10
0.21/0.38	# ...remaining for further processing  : 105
0.21/0.38	# Other redundant clauses eliminated   : 0
0.21/0.38	# Clauses deleted for lack of memory   : 0
0.21/0.38	# Backward-subsumed                    : 2
0.21/0.38	# Backward-rewritten                   : 25
0.21/0.38	# Generated clauses                    : 368
0.21/0.38	# ...of the previous two non-trivial   : 268
0.21/0.38	# Contextual simplify-reflections      : 1
0.21/0.38	# Paramodulations                      : 368
0.21/0.38	# Factorizations                       : 0
0.21/0.38	# NegExts                              : 0
0.21/0.38	# Equation resolutions                 : 0
0.21/0.38	# Propositional unsat checks           : 0
0.21/0.38	#    Propositional check models        : 0
0.21/0.38	#    Propositional check unsatisfiable : 0
0.21/0.38	#    Propositional clauses             : 0
0.21/0.38	#    Propositional clauses after purity: 0
0.21/0.38	#    Propositional unsat core size     : 0
0.21/0.38	#    Propositional preprocessing time  : 0.000
0.21/0.38	#    Propositional encoding time       : 0.000
0.21/0.38	#    Propositional solver time         : 0.000
0.21/0.38	#    Success case prop preproc time    : 0.000
0.21/0.38	#    Success case prop encoding time   : 0.000
0.21/0.38	#    Success case prop solver time     : 0.000
0.21/0.38	# Current number of processed clauses  : 68
0.21/0.38	#    Positive orientable unit clauses  : 43
0.21/0.38	#    Positive unorientable unit clauses: 0
0.21/0.38	#    Negative unit clauses             : 1
0.21/0.38	#    Non-unit-clauses                  : 24
0.21/0.38	# Current number of unprocessed clauses: 151
0.21/0.38	# ...number of literals in the above   : 206
0.21/0.38	# Current number of archived formulas  : 0
0.21/0.38	# Current number of archived clauses   : 37
0.21/0.38	# Clause-clause subsumption calls (NU) : 328
0.21/0.38	# Rec. Clause-clause subsumption calls : 248
0.21/0.38	# Non-unit clause-clause subsumptions  : 11
0.21/0.38	# Unit Clause-clause subsumption calls : 94
0.21/0.38	# Rewrite failures with RHS unbound    : 0
0.21/0.38	# BW rewrite match attempts            : 14
0.21/0.38	# BW rewrite match successes           : 3
0.21/0.38	# Condensation attempts                : 0
0.21/0.38	# Condensation successes               : 0
0.21/0.38	# Termbank termtop insertions          : 3814
0.21/0.38	
0.21/0.38	# -------------------------------------------------
0.21/0.38	# User time                : 0.029 s
0.21/0.38	# System time              : 0.007 s
0.21/0.38	# Total time               : 0.037 s
0.21/0.38	# Maximum resident set size: 1644 pages
0.21/0.38	EOF